Codes for Writing on Dirty Paper
نویسندگان
چکیده
We have investigated coding methods that aim at achieving the Costa capacity. First we have considered the uncoded case to determine what can be gained from coding. After that we have designed codes with a trellis structure that are combined with a two-level quantizer at the transmitter side. Simulations are carried out to determine the coding gains of these methods. We have focussed on vector quantization instead of on scalar quantization to achieve a good performance. 1 System description
منابع مشابه
Approaching the Dirty Paper Limit for Canceling Known Interference
Costa’s “writing on dirty paper”–channel model offers an information theoretic framework for precoding techniques for canceling arbitrary known interference. Using lattice strategies and MMSE scaling, lossless precoding is theoretically possible at any SNR. Following this approach, we report an end-to-end coding realization of a system materializing a significant portion of the promised gains. ...
متن کاملDirty Paper Writing and Watermarking Applications
Following an underlying theme in Communication is the duo of Dirty Paper Writing and Watermarking. In 1983 utilising some previous results by Gelfand, Pinsker, El Gamal and Heegard, Costa gave a method for acheiving capacity in the presence of a known interference. Costa, in his paper, doesn’t mention about any applications of his result, let alone Watermarking. In 1999 Cox et al recognised the...
متن کاملWriting on Dirty Paper in the Presence of Difference Set Noise
Costa’s celebrated “writing on dirty paper” (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN channel Y = X + Z, provided that the “interference” S (no matter how strong it is) is known at the transmitter. While this ability for perfect interference cancellation is very appealing, it relies heavily on the Gaussianity of the ...
متن کاملOn Capacity of the Writing onto Fast Fading Dirt Channel
The classic Costa’s “writing on dirty paper” capacity result establishes that full state pre-cancellation can be attained in the Gel’fand-Pinsker channel with additive state and additive Gaussian noise. This result holds under the assumption that perfect channel knowledge is available at both transmitter and receiver: such an assumption is not valid in wireless scenarios affected by fading and ...
متن کاملDirty-Paper Writing Based on LDPC Codes for Data Hiding
We describe a new binning technic for informed data hiding problem. In information theoretical point of view, the blind watermarking problem can be seen as transmitting a secret message M through a noisy channel on top of an interfered host signal S that is available only at the encoder. We propose an embedding scheme based on Low Density Parity Check(LDPC) codes, in order to quantize the host ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002